Proof that any birational class of non-singular surfaces satisfies the descending chain condition.
نویسندگان
چکیده
منابع مشابه
CORE FORMATION CONDITION THAT SATISFIES THE Ni ABUNDANCE AND W ISOTOPIC RATIO
Introduction: Core-mantle differentiation is one of the most dramatic events in the Earth's history. As a result of core formation, the Earth's mantle is depleted in siderophile elements. Amounts of siderophile elements retained in the mantle give important clues for estimation of core formation condition. It is well known that the observed mantle abundance of Ni is larger than that predicted f...
متن کاملGroups with one conjugacy class of non-normal subgroups - a short proof
For a finite group $G$ let $nu(G)$ denote the number of conjugacy classes of non-normal subgroups of $G$. We give a short proof of a theorem of Brandl, which classifies finite groups with $nu(G)=1$.
متن کاملA Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
The aim of a Software Transactional Memory (STM) is to discharge the programmers from the management of synchronization in multiprocess programs that access concurrent objects. To that end, a STM system provides the programmer with the concept of a transaction. The job of the programmer is to decompose each sequential process the application is made up of into transactions. A transaction is a p...
متن کاملA new class of graphs that satisfies the Chen-Chvátal Conjecture
A well-known combinatorial theorem says that a set of n non-collinear points in the plane determines at least n distinct lines. Chen and Chvátal conjectured that this theorem extends to metric spaces, with an appropriated definition of line. In this work we prove a slightly stronger version of Chen and Chvátal conjecture for a family of graphs containing chordal graphs and distance-hereditary g...
متن کاملTwo conjectures such that the proof of any one of them will lead to the proof that P = NP
In this paper we define a construct called a time-graph. A complete time-graph of order n is the cartesian product of a complete graph with n vertices and a linear graph with n vertices. A time-graph of order n is given by a subset of the set of edges E(n) of such a graph. The notion of a hamiltonian time-graph is defined in a natural way and we define the Hamiltonian time-graph problem (HAMTG)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kyoto Journal of Mathematics
سال: 1959
ISSN: 2156-2261
DOI: 10.1215/kjm/1250776696